Hadamard matrices of order 32 and extremal ternary self-dual codes

نویسندگان

  • Koichi Betsumiya
  • Masaaki Harada
  • Hiroshi Kimura
چکیده

As described in [7], self-dual codes are an important class of linear codes for both theoretical and practical reasons. It is a fundamental problem to classify self-dual codes of modest length and determine the largest minimum weight among self-dual codes of that length (see [7]). By the Gleason–Pierce theorem, there are nontrivial divisible self-dual codes over Fq for q = 2, 3 and 4 only, where Fq denotes the finite field of order q (see [7, Theorem 5]), and

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New extremal ternary self-dual codes

Compared to binary self-dual codes, few methods are known to construct ternary self-dual codes. In this paper, a construction method for ternary self-dual codes is presented. Using this method, a number of new extremal ternary self-dual codes are obtained from weighing matrices. In addition, a classification is given for extremal ternary self-dual codes of length 40 constructed from Hadamard ma...

متن کامل

On ternary self-dual codes of length 24

A hstract-A partial classification is given of the self-dual codes of length 24 over GF(3). The main results are as follows: there are exactly two codes with minimum Hamming distance d = 9; most of the codes have d = 6 and are indecomposable; one code with d = 6 has a trivial automor-phism group (this is the first such self-dual code that has been found); the codes generated by the 59 inequival...

متن کامل

Binary and Ternary Codes of Hadamard Matrices∗

Let H be a Hadamard matrix of order 24. In this note, we show that the extremality of the binary code of H is equivalent to the extremality of the ternary code of HT . This fact has been observed by Assmus and Key [1], as a result of the complete classification of Hadamard matrices of order 24. Our proof is a consequence of more general results on the minimum weight of the dual code of the code...

متن کامل

Self-dual Codes Using Image Restoration Techniques

From past literature it is evident that the search for self-dual codes has been hampered by the computational difficulty of generating the Hadamard matrices required. The use of the cocyclic construction of Hadamard matrices has permitted substantial cut-downs in the search time, but the search space still grows exponentially. Here we look at an adaptation of image-processing techniques for the...

متن کامل

On extremal self-dual ternary codes of length 48

The notion of an extremal self-dual code has been introduced in 1 . As Gleason 2 remarks onemay use invariance properties of the weight enumerator of a self-dual code to deduce upper bounds on the minimum distance. Extremal codes are self-dual codes that achieve these bounds. The most wanted extremal code is a binary self-dual doubly even code of length 72 and minimum distance 16. One frequentl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2011